Multivariate Self-Dual Morphological Operators Based on Extremum Constraint
نویسندگان
چکیده
منابع مشابه
Pseudo Multivariate Morphological Operators based on α-trimmed Lexicographical Extrema
The extension of mathematical morphology to color and more generally to multivariate image data is still an open problem. The definition of multivariate morphological operators requires the introduction of a complete lattice structure on the image data, hence vectorial extrema computation methods are necessary. In this paper, we propose a lexicographical approach with this end, based on the pri...
متن کاملPseudo multivariate morphological operators based on alpha-trimmed lexicographical extrema
The extension of mathematical morphology to color and more generally to multivariate image data is still an open problem. The definition of multivariate morphological operators requires the introduction of a complete lattice structure on the image data, hence vectorial extrema computation methods are necessary. In this paper, we propose a lexicographical approach with this end, based on the pri...
متن کاملOn morphological operators based on rank filters
Rank order morphological operators have been designed to better cope with shape variations and noise than the corresponding operators with plain structuring elements. In this paper, starting from a brief historical overview of rank order "lters and erosions/dilations in digital image processing, rank order based morphological operators are surveyed. We also highlight the relations between these...
متن کاملGenetic Operators Based on Constraint Repair*
In this paper we describe an approach to solve a scheduling problem in the steel making industry with a combination of a constraint repair approach and genetic algorithms. Because several, sometimes conflicting objectives exist in the production of steel, we have proposed a representation of constraint violations and their importance by fuzzy sets (Dorn and Slany 1994). A weighted aggregation o...
متن کاملConstraint-Based Reasoning on Probabilistic Choice Operators
Probabilistic Concurrent Constraint Programming (PCCP) extends concurrent constraint languages with a probabilistic choice operator. This operator has proved to be useful in implementing randomized algorithms as well as stochastic processes. In this report, we present a filtering algorithm dedicated to the probabilistic choice operator which permits to address new kind of applications where pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/596348